Intuitionistic Fuzzy Automaton for Approximate String Matching
نویسندگان
چکیده
منابع مشابه
A Partial Deterministic Automaton for Approximate String Matching
One of the simplest approaches to approximate string matching is to consider the associated non-deterministic nite automaton and make it deterministic. Besides automaton generation, the search time is O(n) in the worst case, where n is the text size. This solution is mentioned in the classical literature but has not been further pursued, due to the large number of automaton states that may be g...
متن کاملApproximate String Matching by Fuzzy Automata
We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the others. This kind of similarity can’t be handled by usual searching algorithms. We present sample situations, which would use this kind of searching. Then we define a f...
متن کاملMultiple Approximate String Matching
We present a very simple and eecient algorithm for on-line multiple approximate string matching. It uses a previously known counting-based lter 9] that searches for a single pattern by quickly discarding uninteresting parts of the text. Our multi-pattern algorithm is based on the simulation of many parallel lters using bits of the computer word. Our average complexity to search r patterns of le...
متن کاملSublinear Approximate String Matching
The present paper deals with the subject of approximate string matching and demonstrates how Chang and Lawler [CL94] conceived a new sublinear time algorithm out of ideas that had previously been known. The problem is to find all locations in a text of length n over a b-letter alphabet where a pattern of length m occurs with up to k differences (substitutions, insertions, deletions). The algori...
متن کاملApproximate String Matching ? Edgar
We present a radically new indexing approach for approximate string matching. The scheme uses the metric properties of the edit distance and can be applied to any other metric between strings. We build a metric space where the sites are the nodes of the suux tree of the text, and the approximate query is seen as a proximity query on that metric space. This permits us nding the R occurrences of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Information and Engineering
سال: 2014
ISSN: 1616-8658,1616-8666
DOI: 10.1016/j.fiae.2014.06.003